Step of Proof: comb_for_int_upper_wf
9,38
postcript
pdf
Inference at
*
I
of proof for Lemma
comb
for
int
upper
wf
:
(
n
,
z
. {
n
...})
(
True)
Type
latex
by (ProveOpCombinatorTyping (Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
)) (first_tok :t) inil_term)) `int_upper_wf`
latex
.
Definitions
t
T
,
,
x
:
A
.
B
(
x
)
,
T
Lemmas
true
wf
,
squash
wf
,
int
upper
wf
origin